Constructing Tournament Representations: An Exercise in Pointwise Relational Programming
نویسنده
چکیده
List or set comprehensions are a wonderful means to define nondeterministic or relational programs. Despite their beauty, comprehensions are somewhat underused in program calculation. The purpose of this paper is to remind the program-calculation community that comprehensions provide a convenient language for specifying and deriving nondeterministic programs in a pointwise manner. We illustrate the style of reasoning by re-solving the well-known problem of constructing tournament representations: Given a sequence x of integers, construct a heap whose inorder traversal is x itself.
منابع مشابه
Pointwise Relational Programming
The point-free relational calculus has been very successful as a language for discussing general programming principles. However, when it comes to speciic applications, the calculus can be rather awkward to use: some things are more clearly and simply expressed using variables. The combination of variables and relational combinators such as converse and choice yields a kind of nondeterministic ...
متن کاملGenetic Programming for Attribute Construction in Data Mining
We use a standard tree-structure representation for each individual. The GP constructs new attributes out of the continuous (real-valued) attributes of the data set being mined. Each individual corresponds to a candidate new attribute. The terminal set consists of all the continuous attributes in the data being mined. The function set consists of four arithmetic operators (+, -, *, /) and two r...
متن کاملPosynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملA Framework for Constructing Correct Qualitative Representations of Geometries using Mereology over Bintrees
In this paper we explore how bintrees can function as a suitable representation for mereological objects, and how such objects can be used to construct correct representations of geometries, with respect to qualitative queries constructed from a given set of mereological relations. We will show how these correct representations can be stored and queried by a traditional relational database usin...
متن کاملLinear programming on SS-fuzzy inequality constrained problems
In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family of continuous t-norms, which covers the whole spectrum of t-norms when the parameter is changed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002